Distributed Graph Algorithms and their Complexity: An Introduction

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel and Distributed Graph Algorithms and their Applications

This paper surveys the advent of graph algorithms in the eld of parallel and distributed computing , both because of the need for fast graph algorithms and also because of the applicability of graph algorithms in the distributed systems arena. A few parallel implementations of commonlyused graph algorithms like minimum spanning tree, all pairs shortest path, and connected components, are discus...

متن کامل

Graph Subcolorings: Complexity and Algorithms

In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint union of complete graphs. Erd˝ os and, independently, Albertson et al., proved that every graph of maximum degree at most 3 has a 2-subcoloring. We point out that this fact is best possible with respect to degree constr...

متن کامل

Locality in Distributed Graph Algorithms

This paper concerns a number of algorithmic problems on graphs and how they may be solved in a distributed fashion. The computational model is such that each node of the graph is occupied by a processor which has its own ID. Processors are restricted to collecting data from others which are at a distance at most away from them in time units, but are otherwise computationally unbounded. This mod...

متن کامل

Complexity of Distributed Statistical Algorithms

This paper constructs bounds on the minimax risk under loss functions when statistical estimation is performed in a distributed environment and with communication constraints. We treat this problem using techniques from information theory and communication complexity. In many cases our bounds rely crucially on metric entropy conditions and the classical reduction from estimation to testing. A n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Interdisciplinary Information Sciences

سال: 2015

ISSN: 1340-9050,1347-6157

DOI: 10.4036/iis.2015.l.04